package demo5;

import java.util.Arrays;

class Student implements Comparable<Student>{
    public String name;
    public int age;
    public int score;
    //构造方法
    public Student(String name, int age, int score) {
        this.name = name;
        this.age = age;
        this.score = score;
    }

    @Override
    public String toString() {
        return "Student{" +
                "name='" + name + '\'' +
                ", age=" + age +
                ", score=" + score +
                '}';
    }

    @Override
    public int compareTo(Student o) {//写比较规则
        //不灵活
        if (this.age > o.age) {
            return 1;
        }else if (this.age < o.age) {
            return -1;
        }else {
            return 0;
        }
        /*if (this.name.compareTo(o.name) > 0) {
            return 1;
        }else if (this.name.compareTo(o.name) < 0) {
            return -1;
        }else {
            return 0;
        }*/
    }
}

public class Test {

    public static void sort(Comparable[] array) {
        for (int i = 0; i < array.length-1; i++) {
            for (int j = 0; j < array.length-1-i; j++) {
                /*if (array[j] > array[j+1]) {
                    //交换
                }*/
                if (array[j].compareTo(array[j+1]) > 0) {
                    Comparable tmp = array[j];
                    array[j] = array[j+1];
                    array[j+1] = tmp;
                }
            }
        }
    }

    public static void main(String[] args) {
        Student[] students = new Student[3];
        students[0] = new Student("张三",19,10);
        students[1] = new Student("lisi",20,20);
        students[2] = new Student("abc",18,5);

        //System.out.println(students[0].compareTo(students[1]));

        sort(students);

        System.out.println(Arrays.toString(students));
    }

    public static void main1(String[] args) {
        int[] array = {1,3,2,10,5,3,7};
        Arrays.sort(array);//数组排序
        System.out.println(Arrays.toString(array));
    }
}
